Double Duplication of Special Classes of Cycle Related Graphs

نویسندگان

چکیده

Let be a simple, finite, connected, plane graph with the vertex set src=image/13427481_02.gif>, edge src=image/13427481_03.gif> and face src=image/13427481_04.gif>). Martin Baca [1] defined, connected src=image/13427481_04.gif> to src=image/13427481_05.gif> antimagic if there exists positive integers src=image/13427481_06.gif> src=image/13427481_07.gif> bijection src=image/13427481_08.gif>: src=image/13427481_09.gif> such that induced mapping src=image/13427481_10.gif>: src=image/13427481_11.gif>, where for src=image/13427481_12.gif>, src=image/13427481_13.gif> is sum of all src=image/13427481_14.gif> edges src=image/13427481_15.gif> surrounding src=image/13427481_12.gif> also bijection. This paper proves existence labeling double duplication vertices by gear src=image/13427481_16.gif> src=image/13427481_17.gif>, grid src=image/13427481_18.gif> src=image/13427481_19.gif>, src=image/13427481_20.gif> even, prism src=image/13427481_21.gif> src=image/13427481_22.gif> strong triangular snake src=image/13427481_23.gif> src=image/13427481_17.gif>. The special graphs can used encrypt decrypt messages, which as real time application. In [3], we tree src=image/13427481_24.gif> thirteen secret numbers extended encode decode numbers, in turn military base, ATM so on.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

INTEGER-MAGIC SPECTRA OF CYCLE RELATED GRAPHS

For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the ...

متن کامل

Construction of Cycle Double Covers for certain classes of graphs

We introduce two classes of graphs, Indonesian graphs and k-doughnut graphs. Cycle double covers are constructed for these classes. In case of doughnut graphs this is done for the values k = 1, 2, 3 and 4.

متن کامل

Classes of line graphs with small cycle double covers

The Small Cycle Double Cover Conjectnre, due to J .A. Bondy, states that every simple bridgeless graph on n vertices has a cycle double cover with at most (n 1) cycles. There are a number of classes of graphs for which this conjecture is known to hold; for example, triangulations of surfaces, complete graphs, and 4-connected planar graphs. In this article, we prove that the conjecture holds for...

متن کامل

Edge pair sum labeling of some cycle related graphs

Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics and Statistics

سال: 2022

ISSN: ['2332-2144', '2332-2071']

DOI: https://doi.org/10.13189/ms.2022.100408